Restoring CSP Satisfiability with MaxSAT
نویسندگان
چکیده
The extraction of a Minimal Unsatisfiable Core (MUC) in a Constraint Satisfaction Problem (CSP) aims to identify a subset of constraints that make a CSP instance unsatisfiable. Recent work has addressed the identification of a Minimal Set of Unsatisfiable Tuples (MUST) in order to restore the CSP satisfiability with respect to that MUC. A two-step algorithm has been proposed: first, a MUC is identified, and second, a MUST in the MUC is identified. This paper proposes an integrated algorithm for restoring satisfiability in a CSP, making use of an unsatisfiability-based MaxSAT solver. The proposed approach encodes the CSP instance as a partial MaxSAT instance, in such a way that solving the MaxSAT instance corresponds to identifying the smallest set of tuples to be removed from the CSP instance to restore satisfiability. Experimental results illustrate the feasibility of the approach.
منابع مشابه
Max-CSP competition 2006: toolbar/toulbar2 solver brief description
This document gives a brief description of the key techniques used in four different versions of toolbar/toulbar2 solvers submitted to the Max-CSP competition 2006. All the solvers exploit an initial upper bound found by a local search solver : maxwalksat [13] (with 5 tries) for toolbar/MaxSAT and INCOP [11] for the other solvers. The solvers are implemented in C code, except for toulbar2 in C++.
متن کاملSequential Encodings from Max-CSP into Partial Max-SAT
We define new encodings from Max-CSP into Partial MaxSAT which are obtained by modelling the at-most-one condition with the sequential SAT encoding of the cardinality constraint ≤ 1(x1, . . . , xn). They have fewer clauses than the existing encodings, and the experimental results indicate that they have a better performance profile.
متن کاملMSCG: Robust Core-Guided MaxSAT Solving
Maximum Satisfiability (MaxSAT) is a well-known optimization version of Propositional Satisfiability (SAT) that finds a wide range of practical applications. This work describes and evaluates the Maximum Satisfiability using the Core-Guided approach solver (MSCG), which is a robust MaxSAT solver that participated in the MaxSAT Evaluation 2014.
متن کاملSolving #SAT and MAXSAT by Dynamic Programming
We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT. Tools from graph structure theory, in particular treewidth, have been used to successfully identify tractable cases in many subfields of AI, including SAT, Constraint Satisfaction Problems (CSP), Bayesian reasoning, and planning. In this paper we attack #SAT and MaxSAT using similar, but mo...
متن کاملSubsumed Label Elimination for Maximum Satisfiability
We propose subsumed label elimination (SLE), a socalled label-based preprocessing technique for the Boolean optimization paradigm of maximum satisfiability (MaxSAT). We formally show that SLE is orthogonal to previously proposed SAT-based preprocessing techniques for MaxSAT in that it can simplify the underlying minimal unsatisfiable core structure of MaxSAT instances. We also formally show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 107 شماره
صفحات -
تاریخ انتشار 2009